Smoothed Analysis of Probabilistic Roadmaps
نویسندگان
چکیده
The probabilistic roadmap algorithm is a leading heuristic for robot motion planning. It is extremely efficient in practice, yet its worst case convergence time is unbounded as a function of the input’s combinatorial complexity. We prove a smoothed polynomial upper bound on the number of samples required to produce an accurate probabilistic roadmap, and thus on the running time of the algorithm, in an environment of simplices. This sheds light on its widespread empirical success.
منابع مشابه
Constructing probabilistic roadmaps with powerful local planning and path optimization
This paper describes a new approach to probabilistic roadmap construction for path planning. The novel feature of the planner is that it uses a powerful local planner to produce highly connected roadmaps and path optimization to maintain the rapid query processing by a fast local operator. While most previous approaches obtain good roadmaps by advanced sampling methods, the presented approach c...
متن کاملFinding Collision Free Path with Probabilistic Roadmaps: The Bounding Volume Expansion
The efficiency of Probabilistic Roadmaps (PRM) depends on the number of samples in free configuration space and computation time to connect such samples. Key idea of this approach is to generate samples with bounding volume expansion and connect free samples based on geometric characteristics so that straight–line local planner does not do collision check while it connects a sample to another. ...
متن کاملVisibility-based probabilistic roadmaps for motion planning
This paper presents a variant of probabilistic roadmap methods (PRM) that recently appeared as a promising approach to motion planning. We exploit a free-space structuring of the con guration space into visibility domains in order to produce small roadmaps, called visibility roadmaps. Our algorithm integrates an original termination condition related to the volume of the free space covered by ...
متن کاملVisibility based probabilistic roadmaps
This paper presents a variant of probabilistic roadmap algorithms that recently appeared as a promising approach to motion planning. We exploit a free-space structuring of the connguration space into visibility domains in order to produce small roadmaps. The algorithm has been implemented within a software platform allowing to address a large class of mechanical systems. Experiments show the ee...
متن کاملAnalysis of probabilistic roadmaps for path planning
We provide an analysis of a recent path planning method which uses probabilistic roadmaps. This method has proven very successful in practice, but the theoretical understanding of its performance is still limited. Assuming that a path exists between two configurations a and b of the robot, we study the dependence of the failure probability to connect a and b on: 1) the length of ; 2) the distan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007